Two-way traffic flow: Exactly solvable model of traffic jam
نویسندگان
چکیده
We study completely asymmetric two-channel exclusion processes in one dimension. It describes a two-way traffic flow with cars moving in opposite directions. The interchannel interaction makes cars slow down in the vicinity of approaching cars in the other lane. Particularly, we consider in detail the system with a finite density of cars on one lane and a single car on the other. When the interchannel interaction reaches a critical value, a traffic jam occurs, which turns out to be of first-order phase transition. We derive exact expressions for the average velocities, the current, the density profile and the k-point density correlation functions. We also obtain the exact probability of two cars being in one lane of distance R apart, provided there is a finite density of cars on the other lane, and show that the two cars form a weakly bound state in the jammed phase.
منابع مشابه
Exactly solvable two-way traffic model with ordered sequential update.
Within the formalism of the matrix product ansatz, we study a two-species asymmetric exclusion process with backward and forward site-ordered sequential updates. This model, which was originally introduced with the random sequential update [J. Phys. A 30, 8497 (1997)], describes a two-way traffic flow with a dynamic impurity and shows a phase transition between the free flow and the traffic jam...
متن کامل1 A ug 1 99 7 Two - way traffic flow : exactly solvable model of traffic jam
We study completely asymmetric 2-channel exclusion processes in 1 dimension. It describes a two-way traffic flow with cars moving in opposite directions. The interchannel interaction makes cars slow down in the vicinity of approaching cars in other lane. Particularly, we consider in detail the system with a finite density of cars on one lane and a single car on the other one. When the interchan...
متن کاملExactly solvable cellular automaton traffic jam model.
A detailed study is undertaken of the v{max}=1 limit of the cellular automaton traffic model proposed by Nagel and Paczuski [Phys. Rev. E 51, 2909 (1995)]. The model allows one to analyze the behavior of a traffic jam initiated in an otherwise freely flowing stream of traffic. By mapping onto a discrete-time queueing system, itself related to various problems encountered in lattice combinatoric...
متن کاملThe Exactly Solvable Simplest Model for Queue Dynamics
We present an exactly solvable model for queue dynamics. Our model is very simple but provides the essential property for such dynamics. As an example, the model has the traveling cluster solution as well as the homogeneous flow solution. The model is the limiting case of Optimal Velocity (OV) model, which is proposed for the car following model to induce traffic jam spontaneously. The concept ...
متن کاملThe Kasteleyn model and a cellular automaton approach to traffic flow
We propose a bridge between the theory of exactly solvable models and the investigation of traffic flow. By choosing the activities in an apropriate way the dimer configurations of the Kasteleyn model on a hexagonal lattice can be interpreted as space-time trajectories of cars. This then allows for a calculation of the flow-density relationship (fundamental diagram). We further introduce a clos...
متن کامل